Cost minimisation technique in geo-distributed data centres
نویسندگان
چکیده
منابع مشابه
Cost Minimization for Big Data Processing in Geo-Distributed Data Centres
Demand on big data is being increasing day by day and also increasing heavy burden on computation, storage and communication in data centres, which lead to considerable expenditure to data centre providers. So, cost minimization became an issue for the upcoming bid data.one of the main feature of bid data is coupling of data and computation as computation task. This can be done only when that c...
متن کاملBohr: Similarity Aware Geo-distributed Data Analytics
We propose Bohr, a similarity aware geo-distributed data analytics system that minimizes query completion time. The key idea is to exploit similarity between data in different data centers (DCs), and transfer similar data from the bottleneck DC to other sites with more WAN bandwidth. Though these sites have more input data to process, these data are more similar and can be more efficiently aggr...
متن کاملConstraint Programming Based Large Neighbourhood Search for Energy Minimisation in Data Centres
EnergeTIC is a recent industrial research project carried out in Grenoble on optimising energy consumption in data centres. We study the problem formulation proposed by EnergeTIC. The problem focuses on the allocation of virtual machines to servers with time-variable resource demands in data centres in order to minimise energy costs while ensuring service quality. We present a scalable constrai...
متن کاملCost-Effective Geo-Distributed Storage for Low-Latency Web Services
We present two systems that we have developed to aid geo-distributed web services deployed in the cloud to serve their users with low latency. First, CosTLO [23] helps mitigate the high latency variance observed when accessing data stored in multi-tenant cloud storage services. To cost-effectively satisfy a web service’s tail latency goals, CosTLO uses measurement-driven inferences about replic...
متن کاملPrinciples of Cost Minimisation in Wireless Networks
This paper considers variations of the minimum connected vertex cover problem to be found in the study of wireless network design. A simple, theoretic formulation is followed by a discussion of practical constraints. Two algorithms are given and results compared.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Aided Engineering and Technology
سال: 2019
ISSN: 1757-2657,1757-2665
DOI: 10.1504/ijcaet.2019.102497